Trees with snowflakes and zero entropy maps

Zero - Entropy Affine Maps on Homogeneous Spaces

On strongly Jordan zero-product preserving maps

In this paper, we give a characterization of strongly Jordan zero-product preserving maps on normed algebras as a generalization of  Jordan zero-product preserving maps. In this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly Jordan zero-product preserving maps are completely different. Also, we prove that the direct p...

Zero entropy Hénon-like maps depend on infinitely many parameters

In the family of area-contracting Hénon-like maps with zero topological entropy we show that there are maps with infinitely many moduli of stability. Thus one cannot find all the possible topological types for non-chaotic area-contracting Hénon-like maps in a family with finitely many parameters. A similar result, but for the chaotic maps in the family, became part of the folklore a short time ...

Entropy Estimate for Maps on Forests

A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...

Complexity of infinite sequences with zero entropy

The complexity function of an infinite word w on a finite alphabet A is the sequence counting, for each nonnegative n, the number of words of lenght n on the alphabet A that are factors of the infinite word w. The goal of this work is to estimate the number of words of lenght n on the alphabet A that are factors of an infinite word w with a complexity function bounded by a given function f with...